On the evolution of the worst-case OBDD size
نویسندگان
چکیده
We prove matching lower and upper bounds on the worst-case OBDD size of a Boolean function, revealing an interesting oscillating behavior.
منابع مشابه
OBDD-Based Representation of Interval Graphs
A graph G = (V,E) can be described by the characteristic function of the edge set χE which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using Ordered Binary Decision Diagrams (OBDDs) to store χE can lead to a (hopefully) compact representation. Given the OBDD as an input, symbolic/implicit OBDD-based graph algorithms can solve optimization problems by mainly using functi...
متن کاملOn the Influence of the State Encoding on OBDD-Representations of Finite State Machines
Ordered binaxy décision diagrams are an important data structure for the représentation of Boolean functions. Typically, the underlying variable ordering is used as an optimization parameter. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze the influence of the state encoding on the OBDD-represe...
متن کاملAsymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
Ordered binary decision diagrams (OBDDs) are nowadays the most common dynamic data structure or representation type for Boolean functions. Among the many areas of application are verification, model checking, and computer aided design. For many functions it is easy to estimate the OBDD size but asymptotically optimal bounds are only known in simple situations. In this paper, methods for proving...
متن کاملThe Role of OBDDs in Controlling the Complexity of Model Based Diagnosis
The computation of consistency-based diagnoses is addressed by using OBDDs (Ordered Binary Decision Diagrams) for encoding both the system model and the resulting diagnoses. We show that the time needed for solving a diagnostic problem is polynomial in the size of the OBDD encoding the system model. While in the worst case such OBDD may have an exponential size, a suitable ordering of the domai...
متن کاملSize and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract)
Abstract. We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. Wegener (1994) showed that for “most” values of n , the expected OBDD-size of a random Boolean function with n variables equals the worst-case size up to terms of lower order. Our main result is that this phenomenon, also known as strong Shannon effect, shows a threshold beh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 77 شماره
صفحات -
تاریخ انتشار 2001